By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.
Table of Contents
Search This Issue
Volume 18, Issue 3, pp. 437-661

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Secure Hypergraphs: Privacy from Partial Broadcast

Matthew Franklin and Moti Yung

pp. 437-450

BibTeX  Abstract Full Text:  PDF

Coloring Powers of Chordal Graphs

Daniel Král'

pp. 451-461

BibTeX  Abstract Full Text:  PDF

The Bar Visibility Number of a Graph

Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jeno Lehel, and Douglas B. West

pp. 462-471

BibTeX  Abstract Full Text:  PDF

The Radon Transform on $\mathbbZ_n^k$

Michelle R. DeDeo and Elinor Velasquez

pp. 472-478

BibTeX  Abstract Full Text:  PDF

Orientable and Nonorientable Genera for Some Complete Tripartite Graphs

Ken-ichi Kawarabayashi, Chris Stephens, and Xiaoya Zha

pp. 479-487

BibTeX  Abstract Full Text:  PDF

Finding Large Independent Sets in Graphs and Hypergraphs

Hadas Shachnai and Aravind Srinivasan

pp. 488-500

BibTeX  Abstract Full Text:  PDF

Bidimensional Parameters and Local Treewidth

Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, and Dimitrios M. Thilikos

pp. 501-511

BibTeX  Abstract Full Text:  PDF

Partition-Optimization with Schur Convex Sum Objective Functions

Frank K. Hwang and Uriel G. Rothblum

pp. 512-524

BibTeX  Abstract Full Text:  PDF

Matroids Induced by Packing Subgraphs

Marek Janata

pp. 525-541

BibTeX  Abstract Full Text:  PDF

Precoloring Extensions of Brooks' Theorem

Michael O. Albertson, Alexandr V. Kostochka, and Douglas B. West

pp. 542-553

BibTeX  Abstract Full Text:  PDF

Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs

Pavol Hell and Jing Huang

pp. 554-570

BibTeX  Abstract Full Text:  PDF

On the Co-P3-Structure of Perfect Graphs

Chính T. Hoàng and Bruce Reed

pp. 571-576

BibTeX  Abstract Full Text:  PDF

Edge-Disjoint Isomorphic Multicolored Trees and Cycles in Complete Graphs

Gregory M. Constantine

pp. 577-580

BibTeX  Abstract Full Text:  PDF

Detachment of Vertices of Graphs Preserving Edge-Connectivity

Balázs Fleiner

pp. 581-591

BibTeX  Abstract Full Text:  PDF

Automorphisms of Projective Spaces and Min-Wise Independent Sets of Permutations

Maxim Vsemirnov

pp. 592-607

BibTeX  Abstract Full Text:  PDF

A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem

C. Chekuri, S. Khanna, J. Naor, and L. Zosin

pp. 608-625

BibTeX  Abstract Full Text:  PDF

A Tight Lower Bound for Online Monotonic List Labeling

Paul F. Dietz, Joel I. Seiferas, and Ju Zhang

pp. 626-637

BibTeX  Abstract Full Text:  PDF

Bridging Separations in Matroids

Jim Geelen, Petr Hlinený, and Geoff Whittle

pp. 638-646

BibTeX  Abstract Full Text:  PDF

Lower Bounds for h-Vectors of k-CM, Independence, and Broken Circuit Complexes

E. Swartz

pp. 647-661

BibTeX  Abstract Full Text:  PDF